Graphs, designs and codes related to the n-cube

For integers n ≥ 1, k ≥ 0, and k ≤ n, the graph Γn has vertices the 2 vectors of F n 2 and adjacency defined by two vectors being adjacent if they differ in k coordinate positions. In particular Γn is the n-cube, usually denoted by Qn. We examine the binary codes obtained from the adjacency matrices of these graphs when k = 1, 2, 3, following results obtained for the binary codes of the n-cube in Fish [6] and Key and Seneviratne [12]. We find the automorphism groups of the graphs and of their associated neighbourhood designs for k = 1, 2, 3, and the dimensions of the ternary codes for k = 1, 2. We also obtain 3-PD-sets for the self-dual binary codes from Γn when n ≡ 0 (mod 4), n ≥ 8.